A Module Calculus for Pure Type Systems
ثبت نشده
چکیده
منابع مشابه
A module calculus for Pure Type Systems � Preliminary
Several proof-assistants rely on the very formal basis of Pure Type Systems. However, some practical issues raised by the development of large proofs lead to add other features to actual implementations for handling namespace management, for developing reusable proof libraries and for separate veriication of distincts parts of large proofs. Unfortunately, few theoretical basis are given for the...
متن کاملA Module Calculus for Pure Type Systems
Several proof-assistants rely on the very formal basis of Pure Type Systems (PTS) as their foundations. We are concerned with the issues involved in the development of large proofs in these provers such as namespace management, development of reusable proof libraries and separate verification. Although implementations offer many features to address them, few theoretical foundations have been la...
متن کاملReviewing the Classical and the de Bruijn Notation for [lambda]-calculus and Pure Type Systems
This article is a brief review of the type-free -calculus and its basic rewriting notions, and of the pure type system framework which generalises many type systems. Both the type-free -calculus and the pure type systems are presented using variable names and de Bruijn indices. Using the presentation of the -calculus with de Bruijn indices, we illustrate how a calculus of explicit substitutions...
متن کاملPure subtype systems : a type theory for extensible software
This thesis presents a novel approach to type theory called “pure subtype systems”, and a core calculus called DEEP which is based on that approach. DEEP is capable of modeling a number of interesting language techniques that have been proposed in the literature, including mixin modules, virtual classes, feature-oriented programming, and partial evaluation. The design of DEEP was motivated by t...
متن کاملInvestigation on the typing of equality in type systems. (Etude sur le typage de l'égalité dans les systèmes de types)
Pure Type Systems are a good way to factorize the questions of meta-theory about a large family of type systems. They have been introduced as a generalization of Barendregt’s λ-cube, an abstraction of several type systems like the Simply Typed λ-Calculus, System F or the Calculus of Constructions. One critical detail of the Pure Type Systems is their conversion rule that allows to do computatio...
متن کامل